Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems
نویسندگان
چکیده
In this research paper, n jobs have to be scheduled on one-machine minimize the sum of maximum earliness and tardiness. We solved a series bi-criteria scheduling problems that related Three new algorithms were presented, two for hierarchical objective one simultaneous objective. Using results these algorithms, we This considered as NP-hard problem, it is also irregular, so missed some helpful properties regularity. The proposed had simple structures, implement. Lastly, they tested different n.
منابع مشابه
Using Heuristic Search for Solving Single Machine Batch Processing Problems
This paper deals with scheduling for single machine batch processing, specifically the transporting problem with one vehicle. Capacity restrictions of 406 T.T. Dang, B. Frankovič, I. Budinská, B. Flood, C. Sheahan, B. L. Dang the machine are considered and the main objective is to find an assignment of jobs to achieve the minimal processing time of all batches, given these capacities. A polynom...
متن کاملa heuristic algorithm for solving single machine scheduling problem with periodic maintenance
in this paper, the scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. the first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with a special tool. we have proposed a new ...
متن کاملDiscovering Heuristic Strategy for Solving Scheduling Problems
Optimally solving a scheduling problem is computationally intractable, hence varieties of techniques and methods have been explored to obtain sub-optimal solutions to such problems. In this paper we introduce a technique that effectively combines appropriate heuristics so as to find a quality solution when used with a hill climbing algorithm. We will demonstrate the proposed approach by applyin...
متن کاملA Graphical Approach for Solving Single Machine Scheduling Problems Approximately
For five single machine total tardiness problems a fully polynomial-time approximation scheme (FPTAS) based on a graphical algorithm is presented. The FPTAS has the best running time among the known approximation schemes for these problems.
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IRAOI JOURNAL OF STATISTICAL SCIENCES
سال: 2022
ISSN: ['2664-2956', '1680-855X']
DOI: https://doi.org/10.33899/iqjoss.2022.176202